Theory Prime Implicates of First Order Formulas
نویسندگان
چکیده
We provide a knowledge compilation technique which deals with the computational intractability of first order reasoning problems. The notion of prime implicates is extended to theory prime implicates in first order case. We provide an algorithm to compute the theory prime implicates of a knowledge base X with respect to a knowledge base Y where both X and Y are assumed to be in Skolem Conjunctive Normal Form. Partial correctness of the algorithm is proved.
منابع مشابه
An algorithm for computing theory prime implicates in first order logic
An algorithm based on consensus method to compute the set of prime implicates of a quantifier free first order formula X was presented in an earlier work. In this paper the notion of prime implicates is extended to theory prime implicates in the first order case. We provide an algorithm to compute the theory prime implicates of a Knowledge base X with respect to another knowledge base Y where b...
متن کاملPrime Implicates of First Order Formulas
This paper extends the notion of prime implicates to first order logic formulas without equality which are assumed to be in Skolem Conjunctive Normal Form. Using the extended notions of consensus and subsumption it is shown that the consensus-subsumption algorithm for computing prime implicates well known for propositional formulas can be conditionally lifted to first order formulas.
متن کاملComputing Theory Prime Implicates in Modal Logic
The algorithm to compute theory prime implicates, a generalization of prime implicates, in propositional logic has been suggested in [16]. In this paper we have extended that algorithm to compute theory prime implicates of a knowledge base X with respect to another knowledge base Y using [2], where Y is a propositional knowledge base and X |= Y , in modal system T and we have also proved its co...
متن کاملAn Efficient Projected Minimal Conflict Generator for Projected Prime Implicate and Implicant Generation
Performing real-time reasoning on models of physical systems is essential in many situations, especially when human intervention is impossible. Since many deductive reasoning tasks take memory or time that is exponential in the number of variables that appear in the model, efforts need to be made to reduce the size of the models used online. The model can be reduced without sacrificing reasonin...
متن کاملAn Incremental Knowledge Compilation in First Order Logic
An algorithm to compute the set of prime implicates of a quantifierfree clausal formula X in first order logic had been presented in earlier work. As the knowledge base X is dynamic, new clauses are added to the old knowledge base. In this paper an incremental algorithm is presented to compute the prime implicates of X and a clause C from π(X) ∪ C. The correctness of the algorithm is also proved.
متن کامل